Trans4E: Link prediction on scholarly knowledge graphs
نویسندگان
چکیده
The incompleteness of Knowledge Graphs (KGs) is a crucial issue affecting the quality AI-based services. In scholarly domain, KGs describing research publications typically lack important information, hindering our ability to analyse and predict dynamics. recent years, link prediction approaches based on Graph Embedding models became first aid for this issue. work, we present Trans4E, novel embedding model that particularly fit which include N M relations with N$\gg$M. This typical categorize large number entities (e.g., articles, patents, persons) according relatively small set categories. Trans4E was applied two large-scale knowledge graphs, Academia/Industry DynAmics (AIDA) Microsoft Academic (MAG), completing information about Fields Study 'neural networks', 'machine learning', 'artificial intelligence'), affiliation types 'education', 'company', 'government'), improving scope accuracy resulting data. We evaluated approach against alternative solutions AIDA, MAG, four other benchmarks (FB15k, FB15k-237, WN18, WN18RR). outperforms when using low dimensions obtains competitive results in high dimensions.
منابع مشابه
Synthesizing Knowledge Graphs for Link and Type Prediction Benchmarking
Despite the growing amount of research in link and type prediction in knowledge graphs, systematic benchmark datasets are still scarce. In this paper, we propose a synthesis model for the generation of benchmark datasets for those tasks. Synthesizing data is a way of having control over important characteristics of the data, and allows the study of the impact of such characteristics on the perf...
متن کاملEnsemble Solutions for Link-Prediction in Knowledge Graphs
Knowledge graphs store up to billions of facts and are used in an increasing number of applications including search and question answering. Besides the freely available knowledge graphs of the Linked Open Data Cloud, there are a number of commercial knowledge graphs as the Google Knowledge Graph and Microsoft’s Satori. Incompleteness is still a major issue in this graphs and has been the topic...
متن کاملSimplE Embedding for Link Prediction in Knowledge Graphs
The aim of knowledge graphs is to gather knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs are far from complete. To address the incompleteness of the knowledge graphs, link prediction approaches have been developed which make probabilistic predictions about new links in a knowledge graph given the existing links. Tensor factorization ...
متن کاملEvaluating Link Prediction on Large Graphs
Exploiting network data (i.e., graphs) is a rather particular case of data mining. The size and relevance of network domains justifies research on graph mining, but also brings forth severe complications. Computational aspects like scalability and parallelism have to be reevaluated, and well as certain aspects of the data mining process. One of those are the methodologies used to evaluate graph...
متن کاملAnalysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs
Knowledge graphs are large, useful, but incomplete knowledge repositories. They encode knowledge through entities and relations which define each other through the connective structure of the graph. This has inspired methods for the joint embedding of entities and relations in continuous low-dimensional vector spaces, that can be used to induce new edges in the graph, i.e., link prediction in k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.02.100